Parsing Pregroup Grammars and Lambek Calculus Using Partial Composition
نویسنده
چکیده
The paper presents a way to transform pregroup grammars into contextfree grammars using functional composition. The same technique can also be used for the proof-nets of multiplicative cyclic linear logic and for Lambek calculus allowing empty premises.
منابع مشابه
PPQ : a pregroup parser using majority composition
Pregroup grammars are a mathematical formalism in the spirit of categorial grammars. They are close to logical formalism like Lambek calculus but have a polynomial parsing algorithm. The paper presents a parser based on pregroup grammar that uses a tabular approach based on majority partial composition.
متن کاملA Pregroup Toolbox for Parsing and Building Grammars of Natural Languages
Pregroup grammars are a mathematical formalism in the spirit of categorial grammars. They are close to logical formalisms like Lambek calculus but have a polynomial parsing algorithm. The paper presents a pregroup toolbox for parsing and building grammars of natural languages, including a parser that uses a tabular approch based on majority partial composition.
متن کاملFully Lexicalized Pregroup Grammars
Pregroup grammars are a context-free grammar formalism introduced as a simplification of Lambek calculus. This formalism is interesting for several reasons: the syntactical properties of words are specified by a set of types like the other type-based grammar formalisms ; as a logical model, compositionality is easy ; a polytime parsing algorithm exists. However, this formalism is not completely...
متن کاملLambek Grammars, Tree Adjoining Grammars and Hyperedge Replacement Grammars
Two recent extension of the nonassociative Lambek calculus, the LambekGrishin calculus and the multimodal Lambek calculus, are shown to generate class of languages as tree adjoining grammars, using (tree generating) hyperedge replacement grammars as an intermediate step. As a consequence both extensions are mildly context-sensitive formalisms and benefit from polynomial parsing algorithms.
متن کاملMildly Context-Sensitive Languages via Buffer Augmented Pregroup Grammars
A family of languages is called mildly context-sensitive if – it includes the family of all -free context-free languages; – it contains the languages • {anbncn : n ≥ 1} – multiple agreement, • {ambncmdn : m,n ≥ 1} – crossed dependencies, and • {ww : w ∈ Σ+} – reduplication; – all its languages are semi-linear; and – their membership problem is decidable in polynomial time. In our paper we intro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Studia Logica
دوره 87 شماره
صفحات -
تاریخ انتشار 2007